"endianless" meaning in All languages combined

See endianless on Wiktionary

Adjective [English]

Etymology: endian + -less Etymology templates: {{suffix|en|endian|less}} endian + -less Head templates: {{en-adjective|-}} endianless (not comparable)
  1. (computing) Lacking endianness. Tags: not-comparable Categories (topical): Computing Related terms: big-endian, little-endian, byte order mark

Download JSON data for endianless meaning in All languages combined (2.9kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "endian",
        "3": "less"
      },
      "expansion": "endian + -less",
      "name": "suffix"
    }
  ],
  "etymology_text": "endian + -less",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "endianless (not comparable)",
      "name": "en-adjective"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms suffixed with -less",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2005, James C. Leiterman, 32/64-Bit 80x86 Assembly Language Architecture (Wordware Applications Library), Plano, Texas: Wordware Publishing, Inc., →LCCN, →OCLC, page 530",
          "text": "Note that the byte is endianless; that is, whether it is big-endian or little-endian, the MSB (most significant bit) is bit #7 and the LSB (least significant bit) is bit #0.",
          "type": "quotation"
        },
        {
          "ref": "2003, James C. Leiterman, Vector Game Math Processors (Wordware Game Math Library), Plano, Texas: Wordware Publishing, Inc., →OCLC, page 530",
          "text": "Shift the original value right by one! Note \"M\" and \"L\" denote most and least significant bits in big or little endian and 8 bit is endianless.",
          "type": "quotation"
        },
        {
          "ref": "2018 May 10, Alessandro Pedretti, Angelica Mazzolari, Giulio Vistoli, “WarpEngine, a Flexible Platform for Distributed Computing Implemented in the VEGA Program and Specially Targeted for Virtual Screening Studies”, in Journal of Chemical Information and Modeling, volume 58, number 6, American Chemical Society, →DOI, retrieved 2023-12-12, Supporting Material, Table S1",
          "text": "Functions to read and write IFF / RIFF files. They are endianless and support 64 bit chunks.",
          "type": "quotation"
        },
        {
          "ref": "2015 August 22, Victor Stinner, “7.4 Byte order marks (BOM)”, in Programming with Unicode Documentation, Release 2011, archived from the original on 2023-12-12, page 22",
          "text": "BOM Encoding Endian\n0x2B 0x2F 0x76 0x38 0x2D (5 bytes) UTF-7 endianless\n0xEF 0xBB 0xBF (3) UTF-8 endianless\n0xFF 0xFE (2) UTF-16-LE little endian\n0xFE 0xFF (2) UTF-16-BE big endian\n0xFF 0xFE 0x00 0x00 (4) UTF-32-LE little endian\n0x00 0x00 0xFE 0xFF (4) UTF-32-BE big endian",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Lacking endianness."
      ],
      "id": "en-endianless-en-adj-HvvMuyQv",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "endianness",
          "endianness"
        ]
      ],
      "raw_glosses": [
        "(computing) Lacking endianness."
      ],
      "related": [
        {
          "word": "big-endian"
        },
        {
          "word": "little-endian"
        },
        {
          "word": "byte order mark"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "endianless"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "endian",
        "3": "less"
      },
      "expansion": "endian + -less",
      "name": "suffix"
    }
  ],
  "etymology_text": "endian + -less",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "endianless (not comparable)",
      "name": "en-adjective"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "big-endian"
    },
    {
      "word": "little-endian"
    },
    {
      "word": "byte order mark"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms suffixed with -less",
        "English terms with quotations",
        "English uncomparable adjectives",
        "en:Computing"
      ],
      "examples": [
        {
          "ref": "2005, James C. Leiterman, 32/64-Bit 80x86 Assembly Language Architecture (Wordware Applications Library), Plano, Texas: Wordware Publishing, Inc., →LCCN, →OCLC, page 530",
          "text": "Note that the byte is endianless; that is, whether it is big-endian or little-endian, the MSB (most significant bit) is bit #7 and the LSB (least significant bit) is bit #0.",
          "type": "quotation"
        },
        {
          "ref": "2003, James C. Leiterman, Vector Game Math Processors (Wordware Game Math Library), Plano, Texas: Wordware Publishing, Inc., →OCLC, page 530",
          "text": "Shift the original value right by one! Note \"M\" and \"L\" denote most and least significant bits in big or little endian and 8 bit is endianless.",
          "type": "quotation"
        },
        {
          "ref": "2018 May 10, Alessandro Pedretti, Angelica Mazzolari, Giulio Vistoli, “WarpEngine, a Flexible Platform for Distributed Computing Implemented in the VEGA Program and Specially Targeted for Virtual Screening Studies”, in Journal of Chemical Information and Modeling, volume 58, number 6, American Chemical Society, →DOI, retrieved 2023-12-12, Supporting Material, Table S1",
          "text": "Functions to read and write IFF / RIFF files. They are endianless and support 64 bit chunks.",
          "type": "quotation"
        },
        {
          "ref": "2015 August 22, Victor Stinner, “7.4 Byte order marks (BOM)”, in Programming with Unicode Documentation, Release 2011, archived from the original on 2023-12-12, page 22",
          "text": "BOM Encoding Endian\n0x2B 0x2F 0x76 0x38 0x2D (5 bytes) UTF-7 endianless\n0xEF 0xBB 0xBF (3) UTF-8 endianless\n0xFF 0xFE (2) UTF-16-LE little endian\n0xFE 0xFF (2) UTF-16-BE big endian\n0xFF 0xFE 0x00 0x00 (4) UTF-32-LE little endian\n0x00 0x00 0xFE 0xFF (4) UTF-32-BE big endian",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Lacking endianness."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "endianness",
          "endianness"
        ]
      ],
      "raw_glosses": [
        "(computing) Lacking endianness."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "endianless"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-06-04 from the enwiktionary dump dated 2024-05-02 using wiktextract (e9e0a99 and db5a844). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.